Concerning low rendering performance of complex data sets which is caused by the limited memory bandwidth and data access speed, a triangle mesh layout algorithm based on greedy optimization strategy was proposed, by rearranging the triangle sequences to improve spatial locality and temporal locality of data. Firstly, the vertices were divided into three categories, according to the improved cost function, the vertex with the minimum cost was chosen as currently active vertex. Then, all adjacent triangles which were not rendered were output, and the neighbors were pushed into buffer. The above steps were executed iteratively until adjacent triangles of all vertices were rendered. Finally, the rearranged triangle sequence was got. The experimental results show that the proposed algorithm can provide a higher vertex cache hit ratio, improve the rendering speed, and reduce the execution time of the sorting, which can effectively solve the problem of data access speed lagging behind the processing speed of Graphics Processing Unit (GPU) seriously.